Candy-passing Games on General Graphs, II
نویسندگان
چکیده
We give a new proof that any candy-passing game on a graph G with at least 4|E(G)|−|V (G)| candies stabilizes. Unlike the prior literature on candy-passing games, we use methods from the general theory of chip-firing games which allow us to obtain a polynomial bound on the number of rounds before stabilization.
منابع مشابه
Candy-passing Games on General Graphs, I
We let G be an undirected graph and denote the vertex and edge sets of G by V (G) and E(G), respectively. The candy-passing game on G is defined by the following rules: • At the beginning of the game, c > 0 candies are distributed among |V (G)| students, each of whom is seated at some distinct vertex v ∈ V (G). • A whistle is sounded at a regular interval. • Each time the whistle is sounded, ev...
متن کاملNash Propagation for Loopy Graphical Games
We introduce NashProp, an iterative and local message-passing algorithm for computing Nash equilibria in multi-player games represented by arbitrary undirected graphs. We provide a formal analysis and experimental evidence demonstrating that NashProp performs well on large graphical games with many loops, often converging in just a dozen iterations on graphs with hundreds of nodes. NashProp gen...
متن کاملIdentifying Onboarding Heuristics for Free-to-Play Mobile Games: A Mixed Methods Approach
The onboarding phase of Free-to-Play mobile games, covering the first few minutes of play, typically sees a substantial retention rate among the players. It is therefore crucial to the success of these games that the onboarding phase promotes engagement to the widest degree possible. In this paper a set of heuristics for the design of onboarding phases in Free-to-Play mobile games is presented....
متن کاملOn Equilibria of Distributed Message-Passing Games
This paper investigates a general class of finite dynamic games where players communicate with each other by message-passing. Messages may be delayed, received out of order, duplicated or lost, but not corrupted. The challenge posed by message-passing games is that the execution of the game is non-deterministic and, thus, the final outcome may not result in an equilibrium. We introduce a notion...
متن کاملMAP Estimation, Message Passing, and Perfect Graphs
Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optimality of such algorithms is only well established for singly-connected graphs and other limited settings. This article extends the set of graphs where MAP estimation is in P and where message passing recovers the exac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0807.4655 شماره
صفحات -
تاریخ انتشار 2008